A partially persistent data structure for the set-union problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولEffect of Relocation and Rotation on Radial Efficiency Scores for a Partially Negative Data Problem
Negative data handling has gained a remarkable importance in the literature of Data Envelopment Analysis (DEA) to address many real life problems. Various erstwhile applications, in this arena, referred relocation of the origin to a superior (RDM) or to an inferior (Translated Input Oriented BCC) neighboring point. In this paper, the conditions for Rotation Invariance of various Data Envelop...
متن کاملA Linear Applicative Solution for the Set Union Problem
This paper is about an applicative solution to the IMPERATIVE Set Union Problem, as posed by Peyton-Jones [3]. The adjectivisation is used here to emphasise that the problem was thought to pose significant questions in finding an applicative solution of the same order of complexity as the imperative version. We show one such solution, written in the style of KRC [5]. The same reasoning, when ap...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملThe Set Union Problem With Unlimited Backtracking
An extension of the disjoint set union problem is considered, where the extra primitive backtrack(i) can undo the last i unions not yet undone. Let n be the total number of elements in all the sets. A data structure is presented that supports each union and find in O(lognj loglogn) worst-case time and each backtrack(i) in 0(1) worst-case time, irrespective of i. The total space required by the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1990
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1990240201891